Finding connected components of a semialgebraic set in subexponential time
نویسندگان
چکیده
منابع مشابه
Description of the Connected Components of a Semialgebraic in Single Exponential Time
This paper is devoted to the following result: let R be a real closed field and S a semialgebraic subset of R defined by a boolean combination of polynomial inequalities. Let D be the sum of the degrees of the polynomials involved. Then it is possible to find algorithmically a description of the semialgebraically connected components of S in sequential time D O(1) and parallel time (n log D). T...
متن کاملFinding strongly connected components in distributed graphs
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongl...
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملOn Finding the Strongly Connected Components in a Directed Graph
We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph. Our new algorithms handle sparse graphs and graphs with many trivial components (containing only one node) more economically than Tarjan's original algorithm. As an application we present an eecient transitive closure algorithm.
متن کاملImplementation of a Linear Expected-Time Algorithm for Finding Connected Components
We describe a robust and efficient implementation of the Karp and Tarzan [4] algorithm for finding the connected components of an undirected graph. The algorithm achieves to find the connected components of a graph G = (V,E) in O(|V|) expected time. The implementation of the algorithm (called GCOMPONENTS) is based on the LEDA library of efficient data types and algorithms [5,6,7]. This is the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 1992
ISSN: 0938-1279,1432-0622
DOI: 10.1007/bf01614146